Dynamic From-Between Chart: A Solution to Dynamic Facility Layout Problems

نویسندگان

  • C. N. Nayak
  • C. Subramani
  • K. K. Krishnan
چکیده

According to [1], the material handling cost comprises about 20-50% of the total operating cost of the facility layout. Typical research on facility layout concentrate on static layout problems where from-to charts are used to evaluate the layout. These layouts are not flexible enough to accommodate any future changes in production. Research on dynamic facility layout also has used the concept of static from-to chart. A more efficient method of modifying the layout is to perform rearrangement whenever there are changes in production rates or product mix. This necessitates a development of methodology that exactly reflects these uncertainties. This paper introduces the concept of dynamic from-between chart to determine the layout redesign points. An algorithm that minimizes the total cost of material handling and redesign has also been developed. A genetic algorithm approach is then used to validate the use of dynamic from-between chart. Effectiveness of the developed methodology is illustrated using a case study that resulted in a consistently improved performance compared to traditional methods in terms of cost.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands

This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...

متن کامل

A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem

The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...

متن کامل

A Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA

A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...

متن کامل

Robust inter and intra-cell layouts design model dealing with stochastic dynamic problems

In this paper, a novel quadratic assignment-based mathematical model is developed for concurrent design of robust inter and intra-cell layouts in dynamic stochastic environments of manufacturing systems. In the proposed model, in addition to considering time value of money, the product demands are presumed to be dependent normally distributed random variables with known expectation, variance, a...

متن کامل

Performance Analysis of Dynamic and Static Facility Layouts in a Stochastic Environment

In this paper, to cope with the stochastic dynamic (or multi-period) problem, two new quadratic assignment-based mathematical models corresponding to the dynamic and static approaches are developed. The product demands are presumed to be dependent uncertain variables with normal distribution having known expectation, variance, and covariance that change from one period to the next one, randomly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007